Sorting Arrays A basic problem that might arise in computer programing is sorting an array. This operation may seem simple but the actual solution may require more work. A major concern in sorting large arrays is the time required in sorting that array. There are many algorithms designed to speed up the sorting time, but there is no single sorting routine that is best suited for sorting all data. For this reason, there are many sorting algorithms (Bubble sort, Quicksort, Insertion sort, Merge sort, Hash sort, Selection sort, Shell sort) that are used in different programs. In sorting, the programmer can sort the array in ascending or descending order. ASCENDING order means that the data elements are sorted lowest to highest order (from 'A' to 'Z'). Although there are many applications in sorting an array in this manner, DESCENDING allows the user to view the data in reverse order. The two orders of sorting can be easily applied to any of the sorting algorithms mentioned above. This QuickBASIC program introduces nine sorting algorithms and offers a graphical and programming veiwpoint on each of the sorting algorithms. The following sorting algorithms are ulilized in this program: Exchange Sorts Number of Operations 1. Bubblesort ½ * N² 2. Shakersort 3. Quicksort Insertion Sorts Number of Operations 4. Linear Insertion 5. Binary Insertion 6. Shellsort Selection Sorts 7. Straight Selection 8. Tree Selection 9. Heapsort
